Dynamic vs. Oblivious Routing in Network Design
نویسندگان
چکیده
منابع مشابه
Oblivious Routing for Sensor Network Topologies
We present oblivious routing algorithms whose routing paths are constructed independent of each other, with no dependence on the routing history. Oblivious algorithms are inherently adaptive to dynamic packet traffic, exhibit low congestion, and require low maintenance. All these attributes make oblivious algorithms to be suitable for sensor networks which are characterized by their limited ene...
متن کاملOblivious Buy-at-bulk Network Design Algorithms
Large-scale networks such as the Internet has emerged as arguably the most complex distributed communication network system. The mere size of such networks and all the various applications that run on it brings a large variety of challenging problems. Similar problems lie in any network transportation, logistics, oil/gas pipeline etc where efficient paths are needed to route the flow of demands...
متن کاملTraffic Oblivious Routing
The objective of the book is to describe recent developments in oblivious routing. There are two broad methodologies for routing network traffic in an oblivious manner without detailed knowledge of the traffic matrix. Both these approaches will be covered in the book. The first is Direct Routing which routes packets along fixed paths, from ingress to egress, that are picked to optimize some obj...
متن کامل3 Oblivious Routing Schemes
where P̂ is a linear projection onto the space of circulations, i.e., of all the flows f with Bf = 0, and ĥ is some fixed unit s-t flow. As we showed last time, once we construct a projection P (·) then we obtain an (1 − ε)-approximate maximum flow algorithm whose performance is described in the following theorem. Theorem 1 If P (·) is an α-approximate affine `∞-projection P (·) onto the space F...
متن کاملOblivious Routing via Random Walks
We present novel oblivious routing algorithms for both splittable and unsplittable multicommodity flow. Our algorithm for minimizing congestion for unsplittable multicommodity flow is the first oblivious routing algorithm for this setting. As an intermediate step towards this algorithm, we present a novel generalization of Valiant’s classical load balancing scheme for packet-switched networks t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2010
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-010-9455-4